Denotational Completeness Revisited
نویسنده
چکیده
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.
منابع مشابه
The IO and OI Hierarchies Revisited
We study languages of λ-terms generated by IO and OI unsafe grammars. These languages can be used to model meaning representations in the formal semantics of natural languages following the tradition of Montague [19]. Using techniques pertaining to the denotational semantics of the simply typed λ-calculus, we show that the emptiness and membership problems for both types of grammars are decidab...
متن کاملFeature & Fluent revisited: from Event Calculus to Fluent Logic Programming
In this paper, we make use of a meta-logical representation based on the Kowalski and Sergot's Event Calculus in order to integrate the discrete uent logic (DFL) proposed in Features & Fluents by Erik Sandewall, into a logic programming (LP) setting. As result of this attempt we obtain an extended LP-based language that we call Fluent Logic Programming (FLP). Completeness result are shown with ...
متن کاملA Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for denotational and deductive completeness. Denotational completeness means that every value of the full set-theoretic type hierarchy can be described by a closed t...
متن کاملThe Semantics of Modal Predicate Logic II. Modal Individuals Revisited
We continue the investigations begun in [10]. We shall define a semantics that is build on a new notion of frame, called coherence frames. In these frames, objects are transcendental (world–independent), as in the standard constant–domain semantics. This will remove the asymmetry between constants and variables of the counterpart semantics of [10]. We demonstrate the completeness of (general) c...
متن کاملSoundness, Completeness and Non-redundancy of Operational Semantics for Verilog Based on Denotational Semantics
This paper investigates three significant questions of Verilog’s operational semantics: soundness, completeness and non-redundancy. Our understanding for these three questions is denotational-based. We provide an operational semantics for Verilog and prove that our operational semantics is sound, complete and non-redundant.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 29 شماره
صفحات -
تاریخ انتشار 1999